On Heron Simplices and Integer Embedding

نویسنده

  • Jan Fricke
چکیده

In [3] problem D22 Richard Guy asked for the existence of simplices with integer lengths, areas, volumes . . . . In dimension two this is well known, these triangles are called Heron triangles. Here I will present my results on Heron tetrahedra, their connection to the existence of an integer box (problem D18), the tools for the search for higher dimensional Heron simplices and my nice embedding conjecture about Heron simplices, which I can only proof in dimension two, but I verified it for a large range in dimension three. 1 Heron triangles 1.1 Basics Proposition 1.1 (Heron formula) Let a, b and c be the lengths of the sides of a triangle, s the half of the perimeter and A the area. Then holds A = s(s − a)(s − b)(s − c). (1)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal integral simplices with no interior integer points

In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In dimension three, we show that any integral maximal latticefree simplex is equivalent to one of seven simplices up to unimodular transformation. For higher dim...

متن کامل

An Introduction to Empty Lattice Simplices

We study simplices whose vertices lie on a lattice and have no other lattice points. Suchèmpty lattice simplices' come up in the theory of integer programming, and in some combi-natorial problems. They have been investigated in various contexts and under varying terminology Can thèemptiness' of lattice simplices bèwell-characterized' ? Is theirìattice-width' small ? Do the integer points of the...

متن کامل

An Introduction to Hollow Simplices (draft)

We study simplices with integer vertices and no other integer points. Such`hollow' simplices come up in the theory of integer programming, and provide a common formulation of some combinatorial problems, including particular cases of the knapsack or the partition problem. They have been investigated in various contexts and under varying terminology Can thèhollowness' of simplices bèwell-charact...

متن کامل

The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices

In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are bounded. Additionally, we present some quasi-polynomial-time and polynomial-time algorithms to solve the integer linear optimization problem defined on simplices minus all their integer vertices assuming that some mi...

متن کامل

Image Steganalysis Based on Co-Occurrences of Integer Wavelet Coefficients

We present a steganalysis scheme for LSB matching steganography based on feature vectors extracted from integer wavelet transform (IWT). In integer wavelet decomposition of an image, the coefficients will be integer, so we can calculate co-occurrence matrix of them without rounding the coefficients. Before calculation of co-occurrence matrices, we clip some of the most significant bitplanes of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008